PRISM

Benchmark
Model:consensus v.1 (MDP)
Parameter(s)N = 2, K = 2
Property:steps_min (exp-reward)
Invocation (default)
../fix-syntax ../prism -javamaxmem 11g -cuddmaxmem 4g -heuristic speed -e 1e-6 -maxiters 1000000 consensus.2.prism consensus.props --property steps_min -const K=2
Execution
Walltime:1.2619967460632324s
Return code:0
Relative Error:3.4911728477625e-05
Log
PRISM
=====

Version: 4.5.dev
Date: Fri Feb 26 16:40:54 CET 2021
Hostname: christopher
Memory limits: cudd=4g, java(heap)=11g
Command line: prism -javamaxmem 11g -cuddmaxmem 4g -heuristic speed -e 1e-6 -maxiters 1000000 consensus.2.prism consensus.props --property steps_min -const K=2

Parsing model file "consensus.2.prism"...

Type:        MDP
Modules:     process1 process2 
Variables:   counter pc1 coin1 pc2 coin2 

Parsing properties file "consensus.props"...

5 properties:
(1) "c1": P>=1 [ F "finished" ]
(2) "c2": Pmin=? [ F "finished"&"all_coins_equal_1" ]
(3) "disagree": Pmax=? [ F "finished"&!"agree" ]
(4) "steps_max": R{"steps"}max=? [ F "finished" ]
(5) "steps_min": R{"steps"}min=? [ F "finished" ]

---------------------------------------------------------------------

Model checking: "steps_min": R{"steps"}min=? [ F "finished" ]
Model constants: K=2

Warning: Switching to sparse engine and (backwards) Gauss Seidel (default for heuristic=speed).

Building model...
Model constants: K=2

Computing reachable states...

Reachability (BFS): 37 iterations in 0.00 seconds (average 0.000027, setup 0.00)

Time for model construction: 0.014 seconds.

Type:        MDP
States:      272 (1 initial)
Transitions: 492
Choices:     400

Transition matrix: 365 nodes (3 terminal), 492 minterms, vars: 10r/10c/2nd

Prob0A: 17 iterations in 0.01 seconds (average 0.000294, setup 0.00)

Prob1E: 18 iterations in 0.00 seconds (average 0.000056, setup 0.00)

Warning: PRISM hasn't checked for zero-reward loops.
Your minimum rewards may be too low...

goal = 8, inf = 0, maybe = 264

Computing remaining rewards...
Engine: Sparse

Building sparse matrix (transitions)... [n=272, nc=392, nnz=484, k=2] [8.3 KB]
Building sparse matrix (transition rewards)... [n=272, nc=392, nnz=0, k=2] [2.6 KB]
Creating vector for state rewards... [2.1 KB]
Creating vector for inf... [2.1 KB]
Allocating iteration vectors... [2 x 2.1 KB]
TOTAL: [19.4 KB]

Starting iterations...

Iterative method: 390 iterations in 0.00 seconds (average 0.000003, setup 0.00)

Value in the initial state: 47.998324237033074

Time for model checking: 0.007 seconds.

Result: 47.998324237033074 (value in the initial state)


Overall running time: 0.241 seconds.

---------------------------------------------------------------------

Note: There were 2 warnings during computation.